Job homing

ABSTRACT

A method executed by a controller of a plurality of processing elements to reduce processing time of a data packet in a network element. The processing elements are arranged in a matrix. Each processing element has a point to point connection with each adjacent processing element, known as a hop. Each processing element also includes a separate processing element storage. The data packet includes a data and a descriptor, the data being transmitted to a first processing element for storage before the descriptor is received by the controller, and the data being processed after the descriptor is received. The method includes receiving the descriptor at the controller, determining that the first processing element does not have an available resource for processing the data, determining a second processing element based on a least number of hops to the first processing element, and transmitting the descriptor to the second processing element.

FIELD

The embodiments of the invention relate to the field of data packetprocessing during the routing of the data packet in a telecommunicationsnetwork. Specifically, the embodiments relate to utilizing a computingmatrix to process the routing of the data packet.

BACKGROUND

A telecommunications network is a collection of end stations that areconnected to each other through communication channels. An end stationis any device capable of communicating with other end stations throughthe channels. Examples of end stations include telephones, fax machines,cell phones, computers, network enabled printers, and even householdelectronics and appliances that are capable of communicating with otherdevices across a network. End stations communicate with other endstations by sending data, typically in the form of a packet, to eachother through the channels. In some networks, the data packets aremanaged in the channels to ensure proper delivery of the packets totheir intended destination end stations and conserve bandwidth of thechannels by reducing or eliminating unnecessary transfers to unintendedend stations.

A network element placed at a point where multiple channels connect orintersect is one method of managing the data packets in the channels.After the network element receives a data packet transferred by a sourceend station, the network element is responsible for processing the datapacket. The processing performed by the network element includesdetermining the intended destination of the data packet and transmittingthe data packet through the proper channel toward the destination endstation.

Some network elements implement a computing matrix to reduce theprocessing time of data packets. A computing matrix includes multipleprocessing elements and is capable of processing multiple data packetssimultaneously, one at each processing element. To further reduceprocessing time, some pre-processing can be performed on each datapacket before it is processed by the computing matrix. Additionally, aspart of pre-processing, a major portion of the data packet is typicallyextracted and stored at a processing element of the computing matrix.After pre-processing is complete and the data packet is ready to beprocessed by the computing matrix, current techniques implement strictscheduling to determine which processing element will perform theprocessing. Strict scheduling means that the processing of the datapacket is always assigned to the processing element where the majorportion of the data packet is stored at.

SUMMARY

In one embodiment, a method is executed by a controller of a pluralityof processing elements to reduce processing time of a data packet in anetwork element by opportunistically assigning a processing job to adifferent processing element than where a data for the processing jobresides. The plurality of processing elements are arranged in a matrixwith a column position and a row position. Each of the plurality ofprocessing elements has a point to point connection with each adjacentprocessing element and each processing element includes a separateprocessing element storage. The data packet includes the data and adescriptor. The data is transmitted to a first processing element of theplurality of processing elements to be stored in a first processingelement storage before the descriptor is received by the controller, andthe data is processed after the descriptor is received. The methodincludes receiving the descriptor at the controller. A determination ismade that the first processing element does not have an availableresource for processing the data. A second processing element of theplurality of processing elements is determined based on a least numberof hops to the first processing element, a hop being a connectionbetween two adjacent processing elements. The descriptor is transmittedto the second processing element.

In another embodiment, a controller manages a plurality of processingelements to reduce processing time of a data packet in a network elementby opportunistically assigning a processing job to a differentprocessing element than where a data for the processing job resides. Theplurality of processing elements are arranged in a matrix with a columnposition and a row position. Each of the plurality of processingelements has a point to point connection with each adjacent processingelement and each processing element includes a separate processingelement storage. The data packet includes the data and a descriptor. Thedata is transmitted to a first processing element of the plurality ofprocessing elements to be stored in a first processing element storagebefore the descriptor is received by the controller, and the data isprocessed after the descriptor is received. The controller comprises areceiving module, a scheduling module coupled to the receiving module,and a transmission module coupled to the scheduling module. Thereceiving module is configured to receive the descriptor. The schedulingmodule is configured to determine that the first processing element doesnot have an available resource for processing the data. The schedulingmodule is further configured to determine a second processing element ofthe plurality of processing elements based on a least number of hops tothe first processing element, a hop being a connection between twoadjacent processing elements. The transmission module is configured totransmit the descriptor to the second processing element.

In an example embodiment, a system employs a computing matrix to reduceprocessing time of a data packet in a network element byopportunistically assigning a processing job. The data packet includes adata and a descriptor. The data is received by the computing matrix andstored before the descriptor is received by the computing matrix. Thedata is processed after the descriptor is received by the computingmatrix. The system comprises a plurality of processing elementsconfigured in a matrix arrangement, and a controller coupled to theplurality of processing elements. Each of the plurality of processingelements has a point to point connection with each adjacent processingelement, and each of the plurality of processing elements includes aseparate processing element storage. The controller is configured toreceive the descriptor of the data packet, and determine that a firstprocessing element of the plurality of processing elements does not havean available resource for processing the data, the data residing withina first processing element storage of the first processing element whenthe descriptor is received. The controller is further configured todetermine a second processing element of the plurality of processingelements based on a least number of hops to the first processingelement, a hop being a connection between two adjacent processingelements, and transmit the descriptor to the second processing.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by wayof limitation, in the figures of the accompanying drawings in which likereferences indicate similar elements. It should be noted that differentreferences to “an” or “one” embodiment in this disclosure are notnecessarily to the same embodiment, and such references mean at leastone. Further, when a particular feature, structure, or characteristic isdescribed in connection with an embodiment, it is submitted that it iswithin the knowledge of one skilled in the art to effect such feature,structure, or characteristic in connection with other embodimentswhether or not explicitly described.

FIG. 1 is a flowchart of one embodiment of a process foropportunistically assigning a processing job of a data packet to aprocessing element of a computing matrix.

FIG. 2 is a diagram of one embodiment of a computing matrix and acontroller that opportunistically assigns a processing job of a datapacket to a processing element of the computing matrix.

FIG. 3 is a flowchart of one exemplary embodiment of a process foropportunistically assigning a processing job of a data packet to aprocessing element of a computing matrix.

FIG. 4 is a diagram of one embodiment of a system implementing acomputing matrix and a controller that opportunistically assigns aprocessing job of a data packet to a processing element of the computingmatrix.

DETAILED DESCRIPTION

In the following description, numerous specific details are set forth.However, it is understood that embodiments of the invention may bepracticed without these specific details. In other instances, well-knowncircuits, structures and techniques have not been shown in detail inorder not to obscure the understanding of this description. In otherinstances, control structures, gate level circuits and full softwareinstruction sequences have not been shown in detail in order not toobscure the invention. Those of ordinary skill in the art, with theincluded descriptions, will be able to implement appropriatefunctionality without undue experimentation.

In the following description and claims, the terms “coupled” and“connected,” along with their derivatives, may be used. It should beunderstood that these terms are not intended as synonyms for each other.“Coupled” is used to indicate that two or more elements, which may ormay not be in direct physical or electrical contact with each other,co-operate or interact with each other. “Connected” is used to indicatethe establishment of communication between two or more elements that arecoupled with each other.

To facilitate understanding of the embodiments, dashed lines have beenused in the figures to signify the optional nature of certain items(e.g., features not supported by a given embodiment of the invention;features supported by a given embodiment, but used in some situationsand not in others).

The techniques shown in the figures can be implemented using code anddata stored and executed on one or more electronic devices. Suchelectronic devices store and communicate (internally and/or with otherelectronic devices over a network) code and data using non-transitorytangible computer-readable storage medium (e.g., magnetic disks; opticaldisks; read only memory; flash memory devices; phase-change memory) andtransitory computer-readable communication medium (e.g., electrical,optical, acoustical or other forms of propagated signals—such as carrierwaves, infrared signals, digital signals, etc.). In addition, suchelectronic devices typically include a set or one or more processorscoupled with one or more other components, such as a storage device, oneor more input/output devices (e.g., keyboard, a touchscreen, and/or adisplay), and a network connection. The coupling of the set ofprocessors and other components is typically through one or more bussesor bridges (also termed bus controllers). The storage device and signalscarrying the network traffic respectively represent one or morenon-transitory tangible computer-readable medium and transitorycomputer-readable communication medium. Thus, the storage device of agiven electronic device typically stores code and/or data for executionon the set of one or more processors of that electronic device. Ofcourse, one or more parts of an embodiment of the invention may beimplemented using different combination of software, firmware, and/orhardware.

As used herein, a network element (e.g., a router, switch, bridge) is apiece of networking equipment, including hardware and software, thatcommunicatively interconnects other equipment on the network (e.g.,other network elements, end stations). Some network elements are“multiple services network elements” that provide support for multiplenetworking functions (e.g., routing, bridging, switching, Layer 2aggregation, session border control, Quality of Service, and/orsubscriber management), and/or provide support for multiple applicationservices (e.g., data, voice, and video). Subscriber end stations (e.g.,servers, workstations, laptops, netbooks, palm tops, mobile phones,smartphones, multimedia phones, Voice Over Internet Protocol (VOIP)phones, user equipment, terminals, portable media players, GPS units,gaming systems, set-top boxes) access content/services provided over theInternet and/or content/services provided on virtual private networks(VPNs) overlaid on (e.g., tunneled through) the Internet. The contentand/or services are typically provided by one or more end stations(e.g., server end stations) belonging to a service or content provideror end stations participating in a peer to peer service, and mayinclude, for example, public webpages (e.g., free content, store fronts,search services), private webpages (e.g., username/password accessedwebpages providing email services), and/or corporate networks over VPNs.Typically, subscriber end stations are coupled (e.g., through customerpremise equipment coupled to an access network (wired or wirelessly)) toedge network elements, which are coupled (e.g., through one or more corenetwork elements) to other edge network elements, which are coupled toother end stations (e.g., server end stations).

Data transfers across a telecommunications network depend on a varietyof different elements in the network, including the medium through whichthe transfers occur and the devices which facilitate the transfers. Oneparticular device for facilitating such transfers is a network element.A network element is placed at points in the network where communicationchannels meet or intersect. These channels can be channels of the samenetwork or channels of different networks, in which case the networkelement connects the different networks together to form a largernetwork. The network element is responsible for routing the data,typically in the form of a packet, to the proper channel fortransmission to the intended destination. This reduces the amount oftraffic on the network by not transmitting the data through unnecessarychannels.

The embodiments of the invention provide a method and system forassigning a processing job of a data packet to a processing element of acomputing matrix during the routing of the data packet. A computingmatrix includes multiple processing elements, and is capable ofprocessing a different data packet at each processing elementsimultaneously. The processing elements are arranged in a matrixtopology, each having a column position and a row position in thematrix. Processing elements can be implemented using any combination ofsoftware, firmware, and/or hardware. In some embodiments, eachprocessing element is a distinct hardware processor or a distinctphysical portion of a hardware processor. In other embodiments, multipleprocessing elements are implemented by firmware or software on a singlehardware processor capable of processing multiple threads ofinstructions simultaneously.

Each processing element includes a point to point connection with eachadjacent processing element. A “hop” will be used hereinafter to denotea connection between two adjacent processing elements. Additionally,each processing element includes its own separate processing elementstorage. The storage for multiple processing elements can be implementedon a single memory device by partitioning the device and assigning apartition to each processing element. Alternatively, each processingelement can utilize a separate memory device for storage. The memorydevice can be any device capable of storing data for any amount of time,including volatile and non-volatile memory devices. Furthermore, thememory device can be implemented within the processor (i.e. on the samechip) or separately as a distinct piece of hardware. The memory deviceis coupled with the processing element or the processor implementing theprocessing element to allow data transfers between the processingelement and the memory device.

A data packet typically includes a descriptor portion (also known as theheader) and a user data portion (also known as the payload). Thedescriptor contains control information for the packet, such as theintended destination of the packet. In contrast, the user data is thesubstantive portion of the packet and contains the actual data that isbeing communicated by the end stations. Hereinafter, the user data orpayload will be referred to as simply the “data.”

During the processing of a data packet in a network element, somepre-processing is typically performed on the data packet before thecomputing matrix performs the bulk of the processing on the packet. Aspart of this pre-processing, the data portion of the packet can beextracted and transmitted to a processing element for storage before thepacket is ready to be processed by a processing element of the computingmatrix. In other words, additional pre-processing can be performed onthe descriptor of the packet after the data portion has been extractedand stored. When pre-processing is complete, the descriptor istransmitted to a processing element of the computing matrix for furtherprocessing.

Current network elements that implement a computing matrix use strictscheduling to determine which processing element the descriptor will betransmitted to after pre-processing is complete. Strict scheduling meansthat the descriptor will always be transmitted to the same processingelement that the data portion of the packet was transmitted to. Thedisadvantages of the prior art include that strict scheduling can resultin oversubscription of the destination processing element and create animbalanced load in the computing matrix.

The embodiments of the present invention overcome the disadvantages ofthe prior art by implementing opportunistic scheduling to determinewhich processing element the descriptor will be transmitted to afterpre-processing is complete. Opportunistic scheduling takes into accounttwo factors when determining the destination processing element of thedescriptor. These two factors are (1) the location of the processingelement that the data portion of the packet was transmitted to and (2)available resources at the destination processing element. If theprocessing element that the data portion was transmitted to does nothave available resources to process the data packet, the descriptor willbe transmitted to the processing element at the next nearest locationthat does have available resources. The advantages of the embodimentsdescribed herein include a higher utilization of the processing elementswhile minimizing the bandwidth and latency associated with thetransmission of data between processing elements.

FIG. 1 is a flowchart of one embodiment of a process foropportunistically assigning a processing job of a data packet to aprocessing element of a computing matrix. The process is typicallyimplemented in a controller that schedules processing jobs for thecomputing matrix. The controller can be implemented through software orfirmware on the same processor as one or more processing elements.Alternatively, the controller can be implemented on a hardware processorseparate from any processing element of the computing matrix.

In one embodiment, the process is started in response to receiving adescriptor of a data packet at the controller (Block 102). As notedabove, by the time the descriptor is received at the controller,pre-processing has been completed on the descriptor and the data packetis ready to be processed by the computing matrix. Furthermore, the dataportion of the packet has been extracted during pre-processing andtransmitted to a first processing element of the computing matrix to bestored in a first processing element storage. It should be noted thatthe “first” designation is only used as an identifier to distinguish oneprocessing element from the other processing elements of the computingmatrix. Thus no other meaning should be implied from the designation.The same holds true for references to a “second” processing elementhereinafter.

After receiving the descriptor, the controller determines that the firstprocessing element does not have the available resource for processingthe data (Block 104). To make the determination, the controller hasaccess to information identifying the first processing element that thedata was transmitted to for storage during pre-processing. In oneembodiment, a unique identification of the first processing element canbe written into the descriptor during pre-processing. Thus, when thecontroller receives the descriptor, the controller can identify thefirst processing element. In another embodiment, the uniqueidentification of the first processing element can be written to amemory device coupled with the controller such that the controller canaccess the memory device to obtain the information.

The controller also has access to information regarding the availabilityof resources for the first processing element. In one embodiment, thecontroller can transmit a query to request the status of the firstprocessing element with regards to the availability of resources. Thisquery can be transmitted to the first processing element, or to adifferent module or processor that maintains an account for theresources of the first processing element. After transmitting the query,the controller receives a response to the query indicating whether thefirst processing element has the available resource. In anotherembodiment, the controller itself can maintain an account for theresources of the first processing element, such that no query isnecessary.

After obtaining information regarding the availability of resources forthe first processing element, the controller determines that the firstprocessing element does not have the available resource to process thedata. Alternatively, the determination can be made at the module orprocessor that maintains the account for the resources of the firstprocessing element, and only the result of the determination istransmitted to the controller.

Furthermore, the determination can be made using several differentcriteria. In one embodiment, the determination that the first processingelement does not have the available resource to process the data is madeif the processing queue of the first processing element is full.Alternatively, a threshold setting can be used such that thedetermination is made if the amount of processing already assigned tothe first processing element is above the threshold.

At Block 106, the controller determines a second processing elementbased on a least number of hops to the first processing element. Asnoted above, a hop is a connection between two adjacent processingelements. Thus, the least number of hops to the first processing elementis the number of connections that must be traversed to reach the firstprocessing element through the shortest path (see FIG. 2 and the relateddiscussion below for more details regarding the least number of hops).Depending on the location of the first processing element and the totalnumber of processing elements in the computing matrix, there can be upto four processing elements that are one hop away from the firstprocessing element. In one embodiment, the controller also checks theavailability of resources for each processing element that have an equalleast number of hops to the first processing element in order todetermine the second processing element. For example, if there are fourprocessing elements that are one hop away from the first processingelement, the controller can check the availability of resources for eachof the four processing elements. If all four of the processing elementsdo not have the available resource, this process can be iterated forprocessing elements at each ascending level of least number of hops tothe first processing element until a second processing element isdetermined.

Furthermore, to determine the least number of hops to the firstprocessing element for any other processing element of the computingmatrix, the controller has access to location information regarding eachof the processing elements. In one embodiment, the unique identificationof the processing elements can be used to determine the location of eachprocessing element in the matrix. In other words, the uniqueidentification of each processing element can be assigned such that theunique identification provides an indication of the location in thematrix (e.g., the unique identification can include the column and rowposition). Alternatively, a table or some other form of a record can bemaintained which include the location information for each processingelement, and the controller can look up the information based on theunique identification.

After determining the second processing element, the controllertransmits the descriptor to the second processing element (Block 108).In one embodiment, the unique identification of the first processingelement is transmitted along with the descriptor to the secondprocessing element. This enables the second processing element todetermine where the data portion of the packet that corresponds with thedescriptor is stored. Thus, if the second processing element needsaccess to the data portion of the packet during processing, the secondprocessing element can transmit a request to the first processingelement. Depending on the processing performed, the request can be awrite request or a read request. In another embodiment, the secondprocessing element can access a memory device that stores the uniqueidentification of the first processing element, and thereby determinewhere the data portion of the packet is stored.

FIG. 2 is a diagram of one embodiment of a computing matrix 208 and acontroller 200 that opportunistically assigns a processing job of a datapacket to a processing element of computing matrix 208. Computing matrix208 includes four columns (0-3) and four rows (0-3), with a processingelement at each column and row position. Thus, computing matrix 208 has16 locations (4 columns*4 rows) and 16 processing elements in thisembodiment. In other embodiments, a computing matrix can have any numberof columns, rows, and processing elements. Furthermore, the number ofcolumns does not have to equal the number of rows and there does nothave to be a processing element at each location of the matrix.

Each processing element is implemented by a network processor; however anetwork processor can implement multiple processing elements. Thenetwork processor can be any type of processing device including ageneral or central processing unit, an application specific integratedcircuit (ASIC) or similar processing device. In other embodiments, a setof network processors are present in the network element. The networkprocessor can be connected with the other components within the networkelement by a set of buses routed over a set of mainboards or similarsubstrates. Similarly, multiple processing elements implemented on asingle network processor can be connected with each other and with astorage device by a set of buses.

Controller 200 is also implemented by a network processor. In someembodiments, controller 200 can be implemented by the same networkprocessor as one or more processing elements. The network processorexecutes the modules of controller 200. Controller 200 can be connectedwith the processing elements and with other components within thenetwork element by a set of buses.

Controller 200 includes receiving module 202, scheduling module 204, andtransmission module 206. Receiving module 202 is configured to receive adescriptor of a data packet after pre-processing is complete. When thedescriptor is received at receiving module 202, the data portion of thepacket has already been extracted and transmitted to a first processingelement of the computing matrix for storage. Scheduling module 204 iscoupled to receiving module 202 and configured to determine that thefirst processing element does not have the available resource forprocessing the data. Scheduling module 204 also determines a secondprocessing element based on a least number of hops to the firstprocessing element. Transmission module 206 is coupled to schedulingmodule 204 and configured to transmit the descriptor to the secondprocessing element after the second processing element has beendetermined.

To assist with the understanding of the concept of least number of hops,an example embodiment is described. Assuming that the data portion of adata packet is transmitted to processing element (1, 1) for storageduring pre-processing, processing element (1, 1) becomes the firstprocessing element in this embodiment. Processing elements (0, 1), (1,0), (2, 1), and (1, 2) all have a least number of hops to the firstprocessing element equal to one. This is because these four processingelements are all adjacent to the first processing element, thus thefirst processing element can be reached by traversing only one hop.Although it is also possible to reach the first processing element whiletraversing more than one hop from any of these four processing elements(e.g., starting from processing element (0, 1), go to (0, 0), then to(1, 0), then to (1, 1), which traverses three hops to reach the firstprocessing element), only the least number of hops is of interest.Processing elements (0, 0), (2, 0), (3, 1), (2, 2), (1, 3), and (0, 2)all have two hops as the least number of hops to the first processingelement (1, 1). Processing elements (3, 0), (3, 2), (2, 3), and (0, 3)all have three hops as the least number of hops to the first processingelement (1, 1). Processing element (3, 3) has four hops as the leastnumber of hops to the first processing element (1, 1).

FIG. 3 is a flowchart of one exemplary embodiment of a process foropportunistically assigning a processing job of a data packet to aprocessing element of a computing matrix. This process is typicallyimplemented in a controller that schedules processing jobs for thecomputing matrix.

In one embodiment, the process is started in response to receiving adescriptor of a data packet at the controller (Block 302). By the timethe descriptor is received at the controller, the data portion of thepacket has been extracted during pre-processing and transmitted to afirst processing element of the computing matrix to be stored in a firstprocessing element storage.

The controller also receives a unique identifier of the first processingelement where the data portion resides (Block 304). The uniqueidentifier can be received as part of the descriptor or it can bereceived separately from the descriptor.

Using the unique identifier, the controller makes a determination ofwhether the first processing element has available resources forprocessing the data (Block 306). The determination can be based onwhether the processing queue of the first processing element is full.Alternatively, a threshold setting can be used in making thedetermination based on whether the amount of processing already assignedto the first processing element is above the threshold.

If it is determined that the first processing element does haveavailable resources, then the process goes to Block 308. The descriptoris transmitted to the first processing element for processing and theprocess is complete.

If it is determined that the first processing element does not haveavailable resources for processing the data, the process goes to Block310. The controller determines a second processing element based on aleast number of hops to the first processing element. In one embodiment,the controller also checks the availability of resources for eachprocessing element having an equal least number of hops to the firstprocessing element. This can be done iteratively starting withprocessing elements that have a least number of hops equal to one. Ifnone of the processing elements one hop away from the first processingelement have available resources, the process is repeated in ascendingorder based on the least number of hops to the first processing elementuntil a second processing element is determined.

After determining the second processing element, the controllertransmits the descriptor to the second processing element for additionalprocessing (Block 312). In one embodiment, the unique identification ofthe first processing element is transmitted along with the descriptor tothe second processing element (Block 314). The second processing elementcan use the unique identification to determine the location of the firstprocessing element. This enables the second processing element totransmit requests to the first processing element, including writerequests or read requests, in order to access the data portion of thepacket.

FIG. 4 is a diagram of one embodiment of a system implementing acomputing matrix 412 and a controller 404 that opportunistically assignsa processing job of a data packet to a processing element of computingmatrix 412. In this embodiment, the system is implemented in a networkelement 400. More specifically, the system is implemented on a firstline card 402 of network element 400. A network element typicallyincludes multiple line cards, depicted in this Figure by the n^(th) linecard 424. The line cards can be connected to each other through switchfabric 426, which performs switching to route data packets between linecards.

Although not depicted in this diagram, computing matrix 412 includesmultiple processing elements. In this embodiment, computing matrix 412is implemented by a network processor. In other embodiments, computingmatrix 412 can be implemented by multiple network processors. Line card402 also includes a first resource 414, among other components. Theprocessing element storage for each processing element can beimplemented on first resource 414 by partitioning first resource 414 andassigning a partition to each processing element. Alternatively,additional resources can be added for implementing processing elementstorage for each processing element. First resource 414 can be anymemory device capable of storing data for any amount of time, includingvolatile and non-volatile memory devices.

Controller 404 can be implemented by the same network processor ascomputing matrix 412. Alternatively, controller 404 can be implementedby a separate network processor. Controller 404 includes receivingmodule 406, scheduling module 408, and transmission module 410. Eachmodule is executed by the network processor implementing controller 404.Receiving module 406 is configured to receive a descriptor of a datapacket after pre-processing is complete. Scheduling module 408 iscoupled to receiving module 406 and configured to determine that a firstprocessing element that has the data stored does not have the availableresource for processing the data. Scheduling module 408 also determinesa second processing element based on a least number of hops to the firstprocessing element. Transmission module 410 is coupled to schedulingmodule 408 and configured to transmit the descriptor to the secondprocessing element after the second processing element has beendetermined.

Line card 402 can also include network processor 416 for performing thepre-processing on data packets. In other embodiments, network processor416 can also implement controller 404 and/or computing matrix 412. Asecond resource 418 can also be implemented on line card 402 as a memorydevice for network processor 416. In another embodiment, first resource414 and second resource 418 can be the same memory device, each resourcebeing a partition of the memory device. Like first resource 414, secondresource 418 can be any memory device capable of storing data for anyamount of time, including volatile and non-volatile memory devices.

Line card 402 can also include an ingress port 420 for receivingincoming data packets and egress port 422 for transmitting outgoing datapackets. Ingress port 420 can be any type or combination of networkingports including wireless or wired connection/communication ports andassociated hardware and software for processing incoming layer 1 and/orlayer 2 data and control traffic. Ingress port 420 thereby connectsnetwork element 400 with any number of network devices and/or computingdevices through one of network connections 428. Similarly, egress port422 can be any type or combination of networking ports includingwireless or wired connection/communication ports and associated hardwareand software for processing outgoing layer 1 and/or layer 2 data andcontrol traffic. Egress port 422 thereby connects network element 400with any number of network devices and/or computing devices through oneof network connections 428. In some embodiments, ingress port 420 andegress port 422 can be implemented as a single port capable ofperforming both receiving and transmitting, typically known in the fieldas a transceiver module port.

After receiving an incoming data packet, ingress port 420 transmits thedata packet to network processor 416 for pre-processing. Duringpre-processing, the data portion of the packet is transmitted to a firstprocessing element of computing matrix 412 for storage. Whenpre-processing is complete, the descriptor of the data packet istransmitted to controller 404. Controller 404 assigns the descriptor toa processing element of computing matrix 412 according to any one of theembodiments described herein. After processing is complete at computingmatrix 412, the data packet is transmitted to a destination line card(e.g., n^(th) line card 424) through switch fabric 426 for outgoingtransmission. In some cases, the destination line card can be the sameas the receiving line card. Additional processing can be performed atthe destination line card before the data packet is transmitted back outinto the network through an egress port on one of network connections428. In this manner, network element 400 performs processing on eachdata packet received and thereby routes the data packet to the propercommunication channel for delivery to its intended destination endstation.

It is to be understood that the above description is intended to beillustrative and not restrictive. Many other embodiments will beapparent to those of skill in the art upon reading and understanding theabove description. The scope of the invention should, therefore, bedetermined with reference to the appended claims, along with the fullscope of equivalents to which such claims are entitled.

What is claimed is:
 1. A method executed by a controller of a pluralityof processing elements to reduce processing time of a data packet in anetwork element by opportunistically assigning a processing job to adifferent processing element than where a data for the processing jobresides, where the plurality of processing elements are arranged in amatrix with a column position and a row position, where each of theplurality of processing elements has a point to point connection witheach adjacent processing element, where each processing element includesa separate processing element storage, where the data packet includesthe data and a descriptor, where the data is transmitted to a firstprocessing element of the plurality of processing elements to be storedin a first processing element storage before the descriptor is receivedby the controller, and where the data is processed after the descriptoris received, the method comprising the steps of: receiving thedescriptor at the controller; determining that the first processingelement does not have an available resource for processing the data;determining a second processing element of the plurality of processingelements based on a least number of hops to the first processingelement, wherein a hop is a connection between two adjacent processingelements; and transmitting the descriptor to the second processingelement.
 2. The method of claim 1, further comprising the step of:determining the second processing element within a second plurality ofprocessing elements based on an amount of processing assigned to each ofthe second plurality of processing elements, wherein each of the secondplurality of processing elements has an equal least number of hops tothe first processing element.
 3. The method of claim 1, whereindetermining that the first processing element does not have theavailable resource for processing the data further comprises the stepsof: transmitting a query to request a status of the first processingelement; and receiving a response to the query indicating whether thefirst processing element has the available resource for processing thedata.
 4. The method of claim 1, further comprising the steps of:receiving a unique identifier of the first processing element along withthe descriptor at the controller; and determining a location of thefirst processing element based on the unique identifier.
 5. The methodof claim 4, further comprising the step of: transmitting the uniqueidentifier of the first processing element along with the descriptor tothe second processing element.
 6. The method of claim 1, whereindetermining that the first processing element does not have theavailable resource for processing the data further comprises the stepof: determining that the first processing element is at a thresholdlevel for an amount of processing assigned to the first processingelement.
 7. A controller for managing a plurality of processing elementsto reduce processing time of a data packet in a network element byopportunistically assigning a processing job to a different processingelement than where a data for the processing job resides, wherein theplurality of processing elements are arranged in a matrix with a columnposition and a row position, wherein each of the plurality of processingelements has a point to point connection with each adjacent processingelement, wherein each processing element includes a separate processingelement storage, wherein the data packet includes the data and adescriptor, wherein the data is transmitted to a first processingelement of the plurality of processing elements to be stored in a firstprocessing element storage before the descriptor is received by thecontroller, and wherein the data is processed after the descriptor isreceived, the controller comprising: a receiving module configured toreceive the descriptor; a scheduling module coupled to the receivingmodule and configured to determine that the first processing elementdoes not have an available resource for processing the data, and furtherconfigured to determine a second processing element of the plurality ofprocessing elements based on a least number of hops to the firstprocessing element, wherein a hop is a connection between two adjacentprocessing elements; and a transmission module coupled to the schedulingmodule and configured to transmit the descriptor to the secondprocessing element.
 8. The controller of claim 7, wherein the schedulingmodule is further configured to determine the second processing elementwithin a second plurality of processing elements based on an amount ofprocessing assigned to each of the second plurality of processingelements, wherein each of the second plurality of processing elementshas an equal least number of hops to the first processing element. 9.The controller of claim 7, wherein the scheduling module is furtherconfigured to transmit a query to request a status of the firstprocessing element and receive a response to the query indicatingwhether the first processing element has the available resource forprocessing the data.
 10. The controller of claim 7, wherein thereceiving module is further configured to receive a unique identifier ofthe first processing element along with the descriptor at thecontroller, and wherein the scheduling module is further configured todetermine a location of the first processing element based on the uniqueidentifier.
 11. The controller of claim 10, wherein the transmissionmodule is further configured to transmit the unique identifier of thefirst processing element along with the descriptor to the secondprocessing element.
 12. The controller of claim 7, wherein thescheduling module determines that the first processing element does nothave the available resource for processing the data by determining thatthe first processing element is at a threshold level for an amount ofprocessing assigned to the first processing element.
 13. A system foremploying a computing matrix to reduce processing time of a data packetin a network element by opportunistically assigning a processing job,wherein the data packet includes a data and a descriptor, wherein thedata is received by the computing matrix and stored before thedescriptor is received by the computing matrix, and wherein the data isprocessed after the descriptor is received by the computing matrix, thesystem comprising: a plurality of processing elements configured in amatrix arrangement, wherein each of the plurality of processing elementshas a point to point connection with each adjacent processing element,and wherein each of the plurality of processing element includes aseparate processing element storage; and a controller coupled to theplurality of processing elements and configured to receive thedescriptor of the data packet, determine that a first processing elementof the plurality of processing elements does not have an availableresource for processing the data, determine a second processing elementof the plurality of processing elements based on a least number of hopsto the first processing element, and transmit the descriptor to thesecond processing, wherein the data resides within a first processingelement storage of the first processing element when the descriptor isreceived, and wherein a hop is a connection between two adjacentprocessing elements.
 14. The system of claim 13, wherein the controlleris further configured to determine the second processing element withina second plurality of processing elements based on an amount ofprocessing assigned to each of the second plurality of processingelements, wherein each of the second plurality of processing elementshas an equal least number of hops to the first processing element. 15.The system of claim 13, wherein the controller is further configured totransmit a query to request a status of the first processing element andreceive a response to the query indicating whether the first processingelement has the available resource for processing the data.
 16. Thesystem of claim 13, wherein the controller is further configured toreceive a unique identifier of the first processing element along withthe descriptor, determine a location of the first processing elementbased on the unique identifier, and transmit the unique identifier alongwith the descriptor to the second processing element.
 17. The system ofclaim 13, wherein the controller determines that the first processingelement does not have the available resource for processing the data bydetermining that the first processing element is at a threshold levelfor an amount of processing assigned to the first processing element.18. The system of claim 13, wherein the second processing element isconfigured to process the data in response to receiving the descriptor.19. The system of claim 13, wherein the second processing element isconfigured to generate an access request for the data and transmit theaccess request to the first processing element, the access requestincluding at least one of a read request and a write request.
 20. Thesystem of claim 13, further comprising an egress port coupled to one ofthe plurality of processing elements and configured to receive the datapacket after processing and transmit the data packet into atelecommunications network.